<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: Member List</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>dijkstra Member List</h1>This is the complete list of members for <a class="el" href="a00009.html">dijkstra</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15">algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#fb4aff7134caa15dcce88668c54899aa">check</a>(graph &amp;G)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#64a1fcb9cca32ff932b9b98a08cff106">dijkstra</a>()</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#d2195288151f7b95bad96f186faef815">distance</a>(const node &amp;n) const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">GTL_ERROR</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">GTL_OK</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#f33f8c44fbe24f40e79c725b782b97dc">predecessor_edge</a>(const node &amp;n) const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#4885d97269ef954ea17047ebf8a697ab">predecessor_node</a>(const node &amp;n) const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#eda156a71bc3eacfb9192e79e5581fef">reached</a>(const node &amp;n) const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#16f9249e8cce25cbd0a3297fc8fa9a44">reset</a>()</td><td><a class="el" href="a00009.html">dijkstra</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#7b30f3d8ad42baae27989bc14befe0d0">run</a>(graph &amp;G)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#d35d95d4ed7a4202a5d048a63aa115b9">shortest_path_edge_iterator</a> typedef</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#c2bc10ad8c2df1a1db40dc6ee8af1089">shortest_path_edges_begin</a>(const node &amp;dest)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#df4b143b1c583871819028a734a1ab01">shortest_path_edges_end</a>(const node &amp;dest)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#5062e9a8339848666efcf2143c4c1881">shortest_path_node_iterator</a> typedef</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#fb6b11117d954b6f83ef03735f47a7e3">shortest_path_nodes_begin</a>(const node &amp;dest)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#5e7c8dd055ab5e397b3ba22292d07024">shortest_path_nodes_end</a>(const node &amp;dest)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#9689f2628f76ddb3747ea18c91bd7041">source</a>(const node &amp;n)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#a91b7c49f9ca6b40a4b95747238fabdc">source</a>() const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#f79383dbbb6b737afcefd8e32350192d">store_preds</a>(bool set)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#a099fc1273e1a7f5902cfe02d5ddabdf">store_preds</a>() const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#1e9971d767046306574551a461aa2238">target</a>(const node &amp;n)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#65fe009e1b882ccebfd62b876d76223d">target</a>() const </td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#92f4394b757f6ffcb372535114a6cbf6">weights</a>(const edge_map&lt; double &gt; &amp;weight)</td><td><a class="el" href="a00009.html">dijkstra</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5">~algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00009.html#3840ee3f3f49662f31e9bfab46fd0d12">~dijkstra</a>()</td><td><a class="el" href="a00009.html">dijkstra</a></td><td><code> [virtual]</code></td></tr>
</table>    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
